|
The Classification Tree Method is a method for test design, as it is used in different areas of software development. It got developed by Grimm and Grochtmann in 1993. Classification Trees in terms of the Classification Tree Method must not be confused with decision trees. The classification tree method consists of two major steps: # Identification of test relevant aspects (so called ''classifications'') and their corresponding values (called ''classes'') as well as # Combination of different classes from all classifications into test cases. The identification of test relevant aspects usually follows the (functional) specification (e.g. requirements, use cases …) of the system under test. These aspects form the input and output data space of the test object. The second step of test design then follows the principles of combinatorial test design.〔 While the method can be applied using a pen and a paper, the usual way involves the usage of the Classification Tree Editor, a software tool implementing the classification tree method.〔 == Application == Prerequisites for applying the classification tree method (CTM) is the selection (or definition) of a system under test. The CTM is a black-box testing method and supports any type of system under test. This includes (but is not limited to) hardware systems, integrated hardware-software systems, plain software systems, including embedded software, user interfaces, operating systems, parsers, and others (or subsystems of mentioned systems). With a selected system under test, the first step of the classification tree method is the identification of test relevant aspects.〔 Any system under test can be described by a set of classifications, holding both input and output parameters. (Input parameters can also include environments states, pre-conditions and other, rather uncommon parameters).〔 Each classification can have any number of disjoint classes, describing the occurrence of the parameter. The selection of classes typically follows the principle of equivalence partitioning for abstract test cases and boundary-value analysis for concrete test cases.〔 Together, all classifications form the classification tree. For semantic purpose, classifications can be grouped into ''compositions''. The maximum number of test cases is the Cartesian product of all classes of all classifications in the tree, quickly resulting in large numbers for realistic test problems. The minimum number of test cases is the number of classes in the classification with the most containing classes. In the second step, test cases are composed by selecting exactly one class from every classification of the classification tree. The selection of test cases originally〔 was a manual task to be performed by the test engineer. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Classification Tree Method」の詳細全文を読む スポンサード リンク
|